Algebraic Attacks Galore!
نویسنده
چکیده
Received: May 15, 2009 This is the first in a two-part survey of current techniques in algebraic cryptanalysis. After introducing the basic setup of algebraic attacks and discussing several attack scenarios for symmetric cryptosystems, public key cryptosystems, and stream ciphers, we discuss a number of individual methods. The XL, XSL, and MutantXL attacks are based on linearization techniques for multivariate polynomial systems. Then we look at Gröbner basis and border bases methods. In the last section we introduce attacks based on integer programming techniques and try them in some concrete cases.
منابع مشابه
Quantification Galore
Perhaps the most influential understanding of how reference to kinds varies across languages is that of Chierchia (1998). In this framework, determiners can in principle apply to kinds and NPs can in principle denote them. English, like other Germanic languages, is taken to realize the latter possibility. One might reasonably expect, then, that it would also realize the former—that is, that it ...
متن کاملAlgebraic Attacks on Stream Ciphers (survey)
Most stream ciphers based on linear feedback shift registers (LFSR) are vulnerable to recent algebraic attacks. In this survey paper, we describe generic attacks: existence of algebraic equations and fast algebraic attacks. The generic attacks only states the existence and gives the upper bound of the complexity. Thus we should find good algebraic equations, case by case, in order to apply the ...
متن کاملOn the immunity of Boolean functions against fast algebraic attacks using bivariate polynomial representation
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks on LFSR-based stream ciphers. Since the notion of algebraic immunity was introduced, the properties and constructions of Boolean functions with maximum algebraic immunity have been researched in a large number of papers. However, it is unclear whether these functions behave well against fast alg...
متن کاملEfficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in O(D) operations, for D ≈ ` n d ́ , rather than in O(D) operations necessary in all p...
متن کاملAlgebraic attacks on certain stream ciphers
To encrypt data streams of arbitrary lengths, keystream generators are used in modern cryptography which transform a secret initial value, called the key, into a long sequence of seemingly random bits. Many designs are based on linear feedback shift registers (LFSRs), which can be constructed in such a way that the output stream has optimal statistical and periodical properties and which can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 1 شماره
صفحات -
تاریخ انتشار 2009